Path graph

Results: 1083



#Item
831A Faster Algorithm for Betweenness Centrality

A Faster Algorithm for Betweenness Centrality

Add to Reading List

Source URL: kops.ub.uni-konstanz.de

Language: English - Date: 2011-10-24 12:37:32
832THE PARALLEL RIGIDITY INDEX OF A GRAPH ALEXANDER POSTNIKOV AND ALEXEY SPIRIDONOV Contents  1. Introduction

THE PARALLEL RIGIDITY INDEX OF A GRAPH ALEXANDER POSTNIKOV AND ALEXEY SPIRIDONOV Contents 1. Introduction

Add to Reading List

Source URL: lesha.goder.com

Language: English - Date: 2011-05-31 10:07:44
833SPARQ2L: Towards Support for Subgraph Extraction Queries in RDF Databases Kemafor Anyanwu Angela Maduko

SPARQ2L: Towards Support for Subgraph Extraction Queries in RDF Databases Kemafor Anyanwu Angela Maduko

Add to Reading List

Source URL: lsdis.cs.uga.edu

Language: English - Date: 2007-03-05 10:38:45
834CCVisu: Automatic Visual Software Decomposition ∗ Dirk Beyer School of Computing Science Simon Fraser University B.C., Canada Download: http://ccvisu.googlecode.com

CCVisu: Automatic Visual Software Decomposition ∗ Dirk Beyer School of Computing Science Simon Fraser University B.C., Canada Download: http://ccvisu.googlecode.com

Add to Reading List

Source URL: www.sosy-lab.org

Language: English - Date: 2013-10-11 06:59:10
835A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA

A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA

Add to Reading List

Source URL: www.stasbusygin.org

Language: English - Date: 2009-02-11 00:35:51
836A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org

A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org

Add to Reading List

Source URL: www.stasbusygin.org

Language: English - Date: 2009-02-11 00:35:51
837CONFRONTING THE CHALLENGES OF GRAPHS AND NETWORKS  Confronting the Challenges of Graphs and Networks Nadya T. Bliss and Matthew C. Schmidt

CONFRONTING THE CHALLENGES OF GRAPHS AND NETWORKS Confronting the Challenges of Graphs and Networks Nadya T. Bliss and Matthew C. Schmidt

Add to Reading List

Source URL: www.ll.mit.edu

Language: English - Date: 2013-10-17 12:10:59
838Detection Theory for Graphs Benjamin A. Miller, Nadya T. Bliss, Patrick J. Wolfe, and Michelle S. Beard Graphs are fast emerging as a common data structure used in many scientific and engineering

Detection Theory for Graphs Benjamin A. Miller, Nadya T. Bliss, Patrick J. Wolfe, and Michelle S. Beard Graphs are fast emerging as a common data structure used in many scientific and engineering

Add to Reading List

Source URL: www.ll.mit.edu

Language: English - Date: 2013-10-17 12:48:29
8392013 IEEE 54th Annual Symposium on Foundations of Computer Science  A forward-backward single-source shortest paths algorithm Uri Zwick Tel Aviv University [removed]

2013 IEEE 54th Annual Symposium on Foundations of Computer Science A forward-backward single-source shortest paths algorithm Uri Zwick Tel Aviv University [removed]

Add to Reading List

Source URL: dbwilson.com

Language: English - Date: 2013-12-01 03:48:54
840Computing the maximum clique in visibility graphs

Computing the maximum clique in visibility graphs

Add to Reading List

Source URL: www.tcs.tifr.res.in

Language: English - Date: 2010-03-10 01:30:36